Polynomial-Time Construction of Linear Network Coding

نویسندگان

  • Kazuo Iwama
  • Harumichi Nishimura
  • Mike Paterson
  • Raymond H. Putra
  • Shigeru Yamashita
چکیده

Constructing k independent sessions between k source-sink pairs with the help of a linear operation at each vertex is one of the most standard problems in network coding. For an unbounded k, this is known to be NP-hard. Very recently, a polynomial-time algorithm was given for k = 2 [Wang and Shroff, ISIT 2007], but was open for a general (constant) k. This paper gives a polynomial-time algorithm for this problem under the assumption that the size of the finite field for the linear operations is bounded by a fixed constant.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Convolutional Network Codes for Cyclic Networks

Most data networks contain cycles, but so far most attention in the literature of network coding has been addressed to multicast in acyclic networks. The original paper on network coding [1] did consider cyclic networks but there it was suggested to transform the cyclic network into an acyclic network using the idea of unrolling the network into a layered network. This approach has many drawbac...

متن کامل

Polynomial-time algorithms for coding across multiple unicasts

We consider the problem of network coding across multiple unicasts. We give, for wired and wireless networks, efficient polynomial time algorithms for finding optimal network codes within the class of network codes restricted to XOR coding between pairs of flows.

متن کامل

Fundamentals of Network Coding: A Review

Network coding broadly refers to the processing of data at the intermediate nodes of a network in addition to routing data from source to destination. The theoretical framework for network coding was first provided by Ahlswede et al. in [1]. In this paper, the authors demonstrate the benefits of network coding over mere routing in improving the throughput of a single-source multicast transmissi...

متن کامل

Secure Network Coding over Small Fields

In the paradigm of network coding, the information-theoretic security problem is encountered in the presence of a wiretapper, who has capability of accessing an unknown channel-subset in communication networks. In order to combat this eavesdropping attack, secure network coding is introduced to prevent information from being leaked to adversaries. For any construction of secure linear network c...

متن کامل

Multirate Media Streaming Using Network Coding

Multimedia data transfers typically involve large volumes of data. Multirate multicast transmissions using layered source coding are generally used to deliver data streams to heterogeneous receivers. Network coding has been envisioned to increase throughput and deliver higher data rates than conventional source coding or no coding. The paper proposes a polynomial time algorithm for multicast to...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2008